List Colourings of Regular Hypergraphs
نویسندگان
چکیده
We show that the list chromatic number of a simple d-regular r-uniform hypergraph is at least (1/2r log(2r 2) + o(1)) log d if d is large.
منابع مشابه
Non-monochromatic non-rainbow colourings of σ-hypergraphs
One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin’s notion of colourings of mixed hypergraphs. In this paper we shall study a specific instance of Voloshin’s idea: a non-monochromatic non-rainbow (NMNR) colouring of a hypergraph is a colouring of its vertices such that every edge has at least two vertices coloured with different colo...
متن کاملConstrained colouring and σ-hypergraphs
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of hypergraphs. In fact, for r-uniform hyperg...
متن کاملList Coloring Hypergraphs
Let H be a hypergraph and let Lv : v ∈ V (H) be sets; we refer to these sets as lists and their elements as colors. A list coloring of H is an assignment of a color from Lv to each v ∈ V (H) in such a way that every edge of H contains a pair of vertices of different colors. The hypergraph H is k-list-colorable if it has a list coloring from any collection of lists of size k. The list chromatic ...
متن کاملSome #p-completeness Proofs for Colourings and Independent Sets
We consider certain counting problems involving colourings of graphs and independent sets in hypergraphs. Using polynomial interpolation techniques, we show that these problems are #P -complete. Therefore, e cient approximate counting is the most one can realistically expect to achieve. Rapidly mixing Markov chains which can be used for approximately solving these counting problems have been re...
متن کاملOn the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings
A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph 0(G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-critical t-uniform hypergraph with a given number of vertices. In particular we show that, for k ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 21 شماره
صفحات -
تاریخ انتشار 2012